Is the discrimination of motion-path length unique?
نویسندگان
چکیده
منابع مشابه
Near-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملVariable Length Path Branch Prediction Variable Length Path Branch Prediction
all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage and that copies bear this notice and the full citation on the rst page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, ...
متن کاملThe Exact Path Length Problem
We study a problem related to finding shortest paths in weighted graphs. We ask whether or not there is a path between two nodes that has a given total cost k. The edge weights of the graph can be both positive and negative integers or even integer vectors. We show that many variants of this problem are NP-complete. We develop a pseudo-polynomial algorithm for (both positive and negative) integ...
متن کاملA comparative study on the path length performance of maze-searching and robot motion planning algorithms
A~stract-Maze-searching algorithms first appeared in graph theory and, more recently, have been studied in works on computational complexity. Although the formulation of the maze-search problem shows a clear relation to robotics, there have been no consistent attempts to connect these two fields. In this paper, a number of existing mazesearching and robot motion planning algorithms are studied ...
متن کاملThe complexity of minimum-length path decompositions
We consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the origi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Perception & Psychophysics
سال: 1977
ISSN: 0031-5117,1532-5962
DOI: 10.3758/bf03198748